0 Permutations avoiding a pattern from S k and at least two patterns from S 3
نویسنده
چکیده
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets Sn(T, τ ) of all permutations in Sn that avoid a pattern τ ∈ Sk and a set T , |T | ≥ 2, of patterns from S3. The main body of the paper is divided into three sections corresponding to the cases |T | = 2, 3 and |T | ≥ 4. As an example, in the fifth section, we obtain the complete classification of all cardinalities of the sets Sn(T, τ ) for k = 4.
منابع مشابه
Permutations avoiding a pattern from Sk and at least two patterns from S3
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets Sn(T, τ) of all permutations in Sn that avoid a pattern τ ∈ Sk and a set T , |T | ≥ 2, of patterns from S3. The main body of the paper is divided into three sections corresponding to the cases |T | = 2, 3 and |T | ≥ 4. As an example, in the fifth section, we obtain the complete classification of a...
متن کاملDecompositions and Statistics for Β(1, 0)-trees and Nonseparable Permutations
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملPattern Avoidance in Coloured Permutations
Let Sn be the symmetric group, Cr the cyclic group of order r, and let S (r) n be the wreath product of Sn and Cr; which is the set of all coloured permutations on the symbols 1, 2, . . . , n with colours 1, 2, . . . , r, which is the analogous of the symmetric group when r = 1, and the hyperoctahedral group when r = 2. We prove, for every 2letter coloured pattern φ ∈ S 2 , that the number of φ...
متن کاملAVOIDANCE OF PARTIALLY ORDERED PATTERNS OF THE FORM k-σ-k
Sergey Kitaev [4] has shown that the exponential generating function for permutations avoiding the generalized pattern σ-k, where σ is a pattern without dashes and k is one greater than the largest element in σ, is determined by the exponential generating function for permutations avoiding σ. We show that the exponential generating function for permutations avoiding the partially ordered patter...
متن کاملS ep 1 99 9 Permutations avoiding a set of patterns T ⊆ S 3 and a pattern τ ∈
In this paper we calculate the cardinality of the set Sn(T, τ) of all permutations in Sn that avoid one pattern from S4 and a nonempty set of patterns from S3. The main body of the paper is divided into four sections corresponding to the cases |T | = 1, 2, 3, and |T | ≥ 4. At the end of each section we provide the tables accumulating all the results obtained.
متن کامل